A Modelling and Tabu Search Heuristic for a Continuous Galvanizing Line Scheduling Problem
نویسندگان
چکیده
منابع مشابه
A Modelling and Tabu Search Heuristic for a Continuous Galvanizing Line Scheduling Problem
With good mechanical properties and corrosion-resistance, galvanized coils are used in many fields nowadays, such as auto industry and household appliance industry. Because of high additional value of galvanized product, steel plants pay much more attention on how to make continuous galvanizing lines (CGL) run efficiently. In this paper, we address a scheduling problem of continuous galvanizing...
متن کاملA Tabu Search Heuristic for the Equitable Coloring Problem
The Equitable Coloring Problem is a variant of the Graph Coloring Problem where the sizes of two arbitrary color classes differ in at most one unit. This additional condition, called equity constraints, arises naturally in several applications. Due to the hardness of the problem , current exact algorithms can not solve large-sized instances. Such instances must be addressed only via heuristic m...
متن کاملTabu Search Heuristic for a Two- Echelon Location-Routing Problem
In this paper we tackle a two-echelon location-routing problem (2E-LRP) by a tabu search metaheuristic. The aim is to define the location and number of two kinds of capacitated facilities, the size of two different vehicle fleets and the related routes on each echelon. The proposed Tabu Search (TS) for the 2E-LRP is based on the decomposition of the problem in two location-routing sub-problems,...
متن کاملA tabu search heuristic for the partition coloring problem
Let G = (V, E) be a non-directed graph, where E is the set of edges and V is the set of nodes. Let also V1, V2, . . . , Vp be a partition of V into q subsets such that V1 ∪ V2 ∪ . . . ∪ Vq = V and Vi ∩ Vj = ∅, ∀i, j = 1, . . . , q with i 6= j. We refer to V1, V2, . . . , Vp as the components of the partition. Then, the Partition Coloring Problem (PCP) consists in finding a subset V p ⊂ V such t...
متن کاملA Tabu Search Heuristic for the Inland Container Transportation Problem
The Inland Container Transportation Problem describes the movement of full and empty containers among a number of terminals, depots and customers in a hinterland region. A trucking company with a homogeneous fleet of trucks has to serve customers which either receive goods by inbound containers or ship goods by outbound containers. While keeping given hard time constraints the total operating t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ISIJ International
سال: 2009
ISSN: 0915-1559,1347-5460
DOI: 10.2355/isijinternational.49.375